Multiple Hotlink Assignment

نویسندگان

  • Sven Fuhrmann
  • Sven Oliver Krumke
  • Hans-Christoph Wirth
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation Algorithm for Hotlink Assignment in the Greedy Model

Link-based information structures such as the web can be enhanced through the addition of hotlinks. Assume that each node in the information structure is associated with a weight representing the access frequency of the node by users. In order to access a particular node, the user must follow a path leading to it from the root. By adding new hotlinks to the tree, it may be possible to reduce th...

متن کامل

Managing Public Cloud Computing in the Enterprise

........................................................................................................................................ 3 VMware in the Enterprise  Current State ............................................................................... 4 Traditional Approaches to Multi-Hypervisor Management .................................................... 5 Requirements for Managing ...

متن کامل

Improved Approximations for the k-Hotlink Assignment Problem and for Binary Searching in Trees

We present a study on two optimization problems in trees: the kHotlink Assignment Problem and the problem of Binary Searching in Trees. For the first problem we prove the existence of an FPTAS when k = 1, improving upon the constant factor algorithm recently obtained in [Jacobs, WADS 2007]. In addition, we develop the first constant factor approximation algorithm for arbitrary k. For the second...

متن کامل

Towards Design of System Hierarchy (research survey)

The paper addresses design/building frameworks for some kinds of tree-like and hierarchical structures of systems. The following approaches are examined: (1) expert-based procedure, (2) hierarchical clustering; (3) spanning problems (e.g., minimum spanning tree, minimum Steiner tree, maximum leaf spanning tree problem; (4) design of organizational " optimal " hierarchies; (5) design of multi-la...

متن کامل

Improvement/Extension of Modular Systems as Combinatorial Reengineering (Survey)

The paper describes development (improvement/extension) approaches for composite (modular) systems (as combinatorial reengineering). The following system improvement/extension actions are considered: (a) improvement of systems component(s) (e.g., improvement of a system component, replacement of a system component); (b) improvement of system component interconnection (compatibility); (c) joint ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001